Combinatorial Dynamics
نویسنده
چکیده
Recently Stewart, Golubitsky and coworkers have formulated a general theory of networks of coupled cells. Their approach depends on groupoids, graphs, balanced equivalence relations and ‘quotient networks’. We present a combinatorial approach to coupled cell systems. While largely equivalent to that of Stewart et al., our approach is motivated by ideas coming from analog computers and avoids abstract algebraic formalism.
منابع مشابه
chromstaR: Tracking combinatorial chromatin state dynamics in space and time
Background: Post-translational modifications of histone residue tails are an important component of genome regulation. It is becoming increasingly clear that the combinatorial presence and absence of various modifications define discrete chromatin states which determine the functional properties of a locus. An emerging experimental goal is to track changes in chromatin state maps across differe...
متن کاملTOWARDS A FORMAL TIE BETWEEN COMBINATORIAL AND CLASSICAL VECTOR FIELD DYNAMICS By
Forman’s combinatorial vector fields on simplicial complexes are a discrete analogue of classical flows generated by dynamical systems. Over the last decade, many notions from dynamical systems theory have found analogues in this combinatorial setting, such as for example discrete gradient flows and Forman’s discrete Morse theory. So far, however, there is no formal tie between the two theories...
متن کاملTheoretical Exploration on Local Stability of Simultaneous Recurrent Neural Network Dynamics for Static Combinatorial Optimization
Abstract— This paper presents a theoretical local stability analysis of the Simultaneous Recurrent Neural network (SRN) as a nonlinear dynamic system operating in relaxation mode for static combinatorial optimization. Specifically, stability of hypercube corners of the SRN dynamics, which are equilibrium points for high-gain node dynamics and useful entities to represent solutions of combinator...
متن کاملNonlinear dynamics in combinatorial games: renormalizing Chomp.
We develop a new approach to combinatorial games that reveals connections between such games and some of the central ideas of nonlinear dynamics: scaling behaviors, complex dynamics and chaos, universality, and aggregation processes. We take as our model system the combinatorial game Chomp, which is one of the simplest in a class of "unsolved" combinatorial games that includes Chess, Checkers, ...
متن کاملCombinatorial Independence in Measurable Dynamics
We develop a fine-scale local analysis of measure entropy and measure sequence entropy based on combinatorial independence. The concepts of measure IE-tuples and measure IN-tuples are introduced and studied in analogy with their counterparts in topological dynamics. Local characterizations of the Pinsker von Neumann algebra and its sequence entropy analogue are given in terms of combinatorial i...
متن کاملVortex Dynamics, Combinatorics and Statistics
This report represents an overview of the interconnections between the dynamics of large vortex systems, combinatorics, n-body problems and statistical mechanics. The combinatorial perturbation method for the 2D vortex problem is discussed; the essential combinatorial sym-plectic transformations to Jacobi-type variables which are based on a binary tree algorithm, is introduced and extended to t...
متن کامل